A search for quantum coin-flipping protocols using optimization techniques - SUPPLEMENTAL MATERIAL
نویسندگان
چکیده
1 An example protocol . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2 SDP characterization of cheating strategies . . . . . . . . . . . . . . . . . . . . . . 4 3 Derivations of the reduced SDPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4 Second-order cone programming formulations and analysis . . . . . . . . . . . . . . 12 5 Developing the strategies in the filter . . . . . . . . . . . . . . . . . . . . . . . . . . 16 6 Computer aided bounds on bias . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 7 New bounds for four-round qubit protocols . . . . . . . . . . . . . . . . . . . . . . 32 8 Random offset . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 9 Zoning-in tests . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 10 Full data for the systematic searches for four and six-round protocols . . . . . . . . 42
منابع مشابه
A search for quantum coin-flipping protocols using optimization techniques
Coin-flipping is a cryptographic task in which two physically separated, mistrustful parties wish to generate a fair coin-flip by communicating with each other. Chailloux and Kerenidis (2009) designed quantum protocols that guarantee coin-flips with near optimal bias away from uniform, even when one party deviates arbitrarily from the protocol. The probability of any outcome in these protocols ...
متن کاملSerial composition of quantum coin flipping and bounds on cheat detection for bit commitment
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in th...
متن کاملar X iv : 0 90 3 . 31 18 v 1 [ qu an t - ph ] 1 8 M ar 2 00 9 Generation of a Common Reference String , secure against Quantum Adversaries , and Applications
In this paper, we present the generation of a common reference string “from scratch” via coin-flipping in the presence of a quantum adversary. First, we present how we achieve quantumsecure coin-flipping using Watrous’ quantum rewinding technique [Wat06]. Then, by combining this coin-flipping with any non-interactive zero-knowledge protocol we get an easy transformation from non-interactive zer...
متن کاملQuantum and classical coin-flipping protocols based on bit-commitment and their point games
We focus on a family of quantum coin-flipping protocols based on quantum bit-commitment. We discuss how the semidefinite programming formulations of cheating strategies can be reduced to optimizing a linear combination of fidelity functions over a polytope. These turn out to be much simpler semidefinite programs which can be modelled using second-order cone programming problems. We then use the...
متن کاملLower bound for a class of weak quantum coin flipping protocols
We study the class of protocols for weak quantum coin flipping introduced by Spekkens and Rudolph (quant-ph/0202118). We show that, for any protocol in this class, one party can win the coin flip with probability at least 1/ √
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015